Module manager: Dr Joseph Grant
Email: pmtjgr@leeds.ac.uk
Taught: Semester 1 (Sep to Jan) View Timetable
Year running 2013/14
| MATH2210 | Introduction to Discrete Mathematics |
| MATH3033 | Graph Theory |
This module is approved as an Elective
This module provides an introduction to the basic ideas such as connectedness, trees, planar graphs, Eulerian and Hamiltonian graphs, directed graphs and the connection between graph theory and the four colour problem. Graph theory is an important mathematical tool in such different areas as linguistics, chemistry and, especially, operational research. The material on complexity theory and algorithmic graph theory is an important bridge between mathematics and theoretical computer science, and is very rich in applications.
To introduce students to some of the main concepts and modeling usefulness of graph theory, and to develop their ability to reason graph theoretically.
On completion of this module, students should be able to:
(a) identify basic examples of isomorphic and non-isomorphic pairs of graphs, and make simple deductions involving vertex degrees, connectedness and bipartite graphs;
(b) apply a selection of criteria related to Eulerian and Hamiltonian graphs;
(c) explain and apply the basic theoems for trees, planar graphs and directed graphs;
(d) understand the Max-flow Min-cut Theorem and its connections to other results in graph theory, and apply the Ford-Fulkerson Algorithm.
(e) show a knowledge of graph colourings of various types, and apply a range of techniques for identifying chromatic numbers for graphs and surfaces;
(f) understand and explain key concepts from computational complexity theory;
(g) explain and apply several graph theoretic algorithms, prove their validity and investigate their speed.
Topics chosen from:
1. Basic definitions. Connected graphs, vertex degrees, bipartite graphs.
2. Adjacency matrices, strongly regular graphs, Friendship Theorem.
3. Eulerian graphs and applications.
4. Hamiltonian graphs, including Dirac's theorem and techniques for identifying non-Hamiltonian graphs.
5. Trees (Cayley's Theorem), line graphs. Multiple connectivity and block graphs.
6. Planar graphs. Euler's theorem, Kuratowski's theorem (without proof).
7. Digraphs, strong connectedness. Robbins' Theorem. Eulerian digraphs. Hamiltonian and semi-Hamiltonian tournaments and Moon's Theorem.
8. Networks. Max-flow Min-cut Theorem (Ford-Fulkerson Algorithm), Menger's Theorem, Konig's Theorem, and applications.
9. Graph colourings. The five-colour theorem for planar graphs, the four-colour theorem for planar graphs (without proof). Brook's Theorem. Edge colourings, Tait colourings.
10. Chromatic numbers of surfaces, applications of the Euler characteristic, Heawood's inequality and the Map Colour Theorem.
11. Graph problems and intractability, including NP-completeness and Cook's Theorem.
12. A selection of graph-theoretic algorithms and associated structural results, from some of the following: minimum connector problem; planarity testing algorithm; electrical networks and searching trees; chromatic polynomials; Menger's Theorems and connectivity; minimum cost-flow; strongly connected and 2-connected components; graph minors.
| Delivery type | Number | Length hours | Student hours |
|---|---|---|---|
| Lecture | 44 | 1 | 44 |
| Private study hours | 156 | ||
| Total Contact hours | 44 | ||
| Total hours (100hr per 10 credits) | 200 | ||
There will be two weekly office hours for students to get additional help, depending on their needs.
Regularcoursework with solution sheets provided later.
| Exam type | Exam duration | % of formal assessment |
|---|---|---|
| Standard exam (closed essays, MCQs etc) | 3.0 Hrs 0 Mins | 100 |
| Total percentage (Assessment Exams) | 100 | |
Normally resits will be assessed by the same methodology as the first attempt, unless otherwise stated
The reading list is available from the Library website
Last updated: 2/17/2014
Errors, omissions, failed links etc should be notified to the Catalogue Team